FORCING AND THE HALPERN-LÄUCHLI THEOREM
نویسندگان
چکیده
منابع مشابه
The Halpern-läUchli Theorem at a Measurable cardinal
Several variants of the Halpern-Läuchli Theorem for trees of uncountable height are investigated. For κ weakly compact, we prove that the various statements are all equivalent, and hence, the strong tree version holds for one tree on any weakly compact cardinal. For any finite d ≥ 2, we prove the consistency of the Halpern-Läuchli Theorem on d many normal κ-trees at a measurable cardinal κ, giv...
متن کاملClass forcing, the forcing Theorem and Boolean Completions
The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a condition in the relevant generic filter. We show that both the definability (and, in fact, even the amenability) of the forcing relation and the truth lemma ca...
متن کاملA new proof of the 2-dimensional Halpern–Läuchli Theorem
We provide an ultrafilter proof of the 2-dimensional Halpern–Läuchli Theorem in the following sense. If T0 and T1 are trees and T0 ⊗ T1 denotes their level product, we exhibit an ultrafilter U ∈ β(T0 ⊗ T1) so that every A ∈ U contains a subset of the form S0 ⊗ S1 for suitable strong subtrees of T0 and T1. We then discuss obstacles to extending our method of proof to higher dimensions.
متن کاملForcing and the Omitting Type Theorem, institutionally
In the context of proliferation of many logical systems in the area of mathematical logic and computer science, we present a generalization of forcing in institution-independent model theory which is used to prove an abstract Omitting Types Theorem (OTT). We instantiate this general result to many first-order logics, which are, roughly speaking, logics whose sentences can be constructed from at...
متن کاملMeasurable events indexed by products of trees
A tree T is said to be homogeneous if it is uniquely rooted and there exists an integer b > 2, called the branching number of T , such that every t ∈ T has exactly b immediate successors. A vector homogeneous tree T is a finite sequence (T1, ..., Td) of homogeneous trees and its level product ⊗T is the subset of the cartesian product T1 × ...× Td consisting of all finite sequences (t1, ..., td)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2019
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2019.59